Local Irreducibility of Tail-Biting Trellises

Algebraic Structure Theory of Tail-Biting Trellises

A Coset Construction for Tail-Biting Trellises

A coset construction is presented for tail-biting trellises which for a given linear block code C computes a non-mergeable linear trellis representing C. This construction is analogous to the Forney construction for minimal conventional trellises. Unlike the case of conventional trellises where the Forney construction and the Kschischang-Sorokine (KS) product construction give isomorphic trelli...

Unifying Views of Tail-Biting Trellises for Linear Block Codes

This thesis presents new techniques for the construction and specification of linear tail-biting trellises. Tail-biting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis descriptions. Conventional trellises for block codes have a well understood underlying theory. On the other...

The Structure of Tail-Biting Trellises: Minimality and Basic Principles

Algebraic Construction of Tail-Biting Trellises for Linear Block Codes

In this paper, we present an algebraic construction of tail-biting trellises. The proposed method is based on the state space expressions, i.e., the state space is the image of the set of information sequences under the associated state matrix. Then combining with the homomorphism theorem, an algebraic trellis construction is obtained. We show that a tailbiting trellis constructed based on the ...